Online measurement of dynamic changes in tracking load
نویسندگان
چکیده
منابع مشابه
Neural Measures of Dynamic Changes in Attentive Tracking Load
In everyday life, we often need to track several objects simultaneously, a task modeled in the laboratory using the multiple-object tracking (MOT) task [Pylyshyn, Z., & Storm, R. W. Tracking multiple independent targets: Evidence for a parallel tracking mechanism. Spatial Vision, 3, 179-197, 1988]. Unlike MOT, however, in life, the set of relevant targets tends to be fluid and change over time....
متن کاملTruck Instrumentation for Dynamic Load Measurement
10. Work Unit No. (TRAIS) 9. Performing Organization Name and Address Texas Transportation Institute The Texas A&M University System College Station, Texas 77843-3135 11. Contract or Grant No. Project 0-4863 13. Type of Report and Period Covered Technical Report: September 2004 B July 2006 12. Sponsoring Agency Name and Address Texas Department of Transportation Research and Technology Impleme...
متن کاملOnline multiple people tracking-by-detection in crowded scenes
Multiple people detection and tracking is a challenging task in real-world crowded scenes. In this paper, we have presented an online multiple people tracking-by-detection approach with a single camera. We have detected objects with deformable part models and a visual background extractor. In the tracking phase we have used a combination of support vector machine (SVM) person-specific classifie...
متن کاملApplying graph partitioning methods in measurement-based dynamic load balancing
Load imbalance leads to an increasing waste of resources as an application is scaled to more and more processors. Achieving the best parallel efficiency for a program requires optimal load balancing which is a NP-hard problem. However, finding near-optimal solutions to this problem for complex computational science and engineering applications is becoming increasingly important. Charm++, a migr...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2010
ISSN: 1534-7362
DOI: 10.1167/8.6.499